Underspecified computation of normal forms
نویسندگان
چکیده
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of formulas that are described by dominance graphs, and a certain class of rewrite systems that we use to approximate entailment, and show how to compute the irreducible trees efficiently by intersecting tree automata. Our algorithm solves a 25-year-old problem in computational linguistics.
منابع مشابه
Normal forms of Hopf Singularities: Focus Values Along with some Applications in Physics
This paper aims to introduce the original ideas of normal form theory and bifurcation analysis and control of small amplitude limit cycles in a non-technical terms so that it would be comprehensible to wide ranges of Persian speaking engineers and physicists. The history of normal form goes back to more than one hundreds ago, that is to the original ideas coming from Henry Poincare. This tool p...
متن کاملModular Graph Rewriting to Compute Semantics
Taking an asynchronous perspective on the syntax-semantics interface, we propose to use modular graph rewriting systems as the model of computation. We formally define them and demonstrate their use with a set of modules which produce underspecified semantic representations from a syntactic dependency graph. We experimentally validate this approach on a set of sentences. The results open the wa...
متن کاملSemantic Underspecification : Which Technique for What Purpose ?
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کاملSemantic Underspecification : Which Technique for What
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کاملThe Impact of Syntax on the Interpretation and Graphical Depiction of Underspecified Propositions
Different representational systems permit differing degrees and forms of ambiguity and underspecification in the content they represent. Independently of this observation, a notable feature of natural language as a representational system is that it allows the same content to be expressed in different ways. In this paper, we examine the interaction of these two observations; in particular, we e...
متن کامل